Computing All Elliptic Curves Over an Arbitrary Number Field with Prescribed Primes of Bad Reduction

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Elliptic Curves over Q: Bad Reduction at One Prime

We discuss a new algorithm for finding all elliptic curves over Q with a given conductor. Though based on (very) classical ideas, this approach appears to be computationally quite efficient. We provide details of the output from the algorithm in case of conductor p or p2, for p prime, with comparisons to existing data.

متن کامل

Ranks of Elliptic Curves with Prescribed Torsion over Number Fields

We study the structure of the Mordell–Weil group of elliptic curves over number fields of degree 2, 3, and 4. We show that if T is a group, then either the class of all elliptic curves over quadratic fields with torsion subgroup T is empty, or it contains curves of rank 0 as well as curves of positive rank. We prove a similar but slightly weaker result for cubic and quartic fields. On the other...

متن کامل

Reduction of elliptic curves over certain real quadratic number fields

The main result of this paper is that an elliptic curve having good reduction everywhere over a real quadratic field has a 2-rational point under certain hypotheses (primarily on class numbers of related fields). It extends the earlier case in which no ramification at 2 is allowed. Small fields satisfying the hypotheses are then found, and in four cases the non-existence of such elliptic curves...

متن کامل

Finding All Elliptic Curves with Good Reduction Outside a Given Set of Primes

We describe an algorithm for determining elliptic curves defined over a given number field with a given set of primes of bad reduction. Examples are given over Q and over various quadratic fields.

متن کامل

Computing Elliptic Curves over Q

We discuss an algorithm for finding all elliptic curves over Q with a given conductor. Though based on classical ideas derived from reducing the problem to one of solving associated Thue-Mahler equations, our approach, in many cases at least, appears to be reasonably efficient computationally. We provide details of the output derived from running the algorithm, concentrating on the cases of con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Experimental Mathematics

سال: 2017

ISSN: 1058-6458,1944-950X

DOI: 10.1080/10586458.2017.1325791